fixed permutation

fixed permutation
перестановка с постоянным кодом

Англо-русский словарь по компьютерной безопасности. . 2011.

Игры ⚽ Поможем решить контрольную работу

Смотреть что такое "fixed permutation" в других словарях:

  • Permutation — For other uses, see Permutation (disambiguation). The 6 permutations of 3 balls In mathematics, the notion of permutation is used with several slightly different meanings, all related to the act of permuting (rearranging) objects or values.… …   Wikipedia

  • Permutation matrix — In mathematics, in matrix theory, a permutation matrix is a square (0,1) matrix that has exactly one entry 1 in each row and each column and 0 s elsewhere. Each such matrix represents a specific permutation of m elements and, when used to… …   Wikipedia

  • Random permutation statistics — The statistics of random permutations, such as the cycle structure of a random permutation are of fundamental importance in the analysis of algorithms, especially of sorting algorithms, which operate on random permutations. Suppose, for example,… …   Wikipedia

  • Cycles and fixed points — 16 bit Gray code permutation G multiplied with the bit reversal permutation B G has 2 fixed points, 1 2 cycle and 3 4 cycles B has 4 fixed points and 6 2 cycles GB has 2 fixed points and 2 7 cycles …   Wikipedia

  • Cyclic permutation — A cyclic permutation or circular permutation is a permutation built from one or more sets of elements in cyclic order. The notion cyclic permutation is used in different, but related ways: Contents 1 Definition 1 2 Definition 2 3 Definition 3 …   Wikipedia

  • Random permutation — A random permutation is a random ordering of a set of objects, that is, a permutation valued random variable. The use of random permutations is often fundamental to fields that use randomized algorithms. Such fields include coding theory,… …   Wikipedia

  • Parity of a permutation — Permutations of 4 elements Odd permutations have a green or orange background. The numbers in the right column are the inversion numbers (sequence …   Wikipedia

  • Data Encryption Standard — The Feistel function (F function) of DES General Designers IBM First publis …   Wikipedia

  • Lucifer (cipher) — In cryptography, Lucifer was the name given to several of the earliest civilian block ciphers, developed by Horst Feistel and his colleagues at IBM. Lucifer was a direct precursor to the Data Encryption Standard. One version, alternatively named… …   Wikipedia

  • New Data Seal — General First published 1975 Derived from Lucifer Cipher detail Key sizes 2048 bits Block sizes 128 bits Structure …   Wikipedia

  • Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»